Sweeping Simplices: A Fast Iso-Surface Extraction Algorithm for Unstructured Grids
نویسندگان
چکیده
We present an algorithm that accelerates the extraction of iso-surfaces from unstructured grids by avoiding the traversal of the entire set of cells in the volume. The algorithm consists of a sweep algorithm and a data decomposition scheme. The sweep algorithm in-crementally locates intersected elements, and the data decomposition scheme restricts the algorithm's worst-case performance. For data sets consisting of hundreds of thousands of elements, our algorithm can reduce the cell traversal time more than 90% over the naive iso-surface extraction algorithm, thus facilitating interactive probing of scalar elds for large-scale problems on unstructured three-dimensional grids.
منابع مشابه
A Near Optimal Isosurface Extraction
| We present the \Near Optimal IsoSurface Extraction" (NOISE) algorithm for rapidly extracting isosurfaces from structured and unstructured grids. Using the span space, a new representation of the underlying domain, we develop an isosurface extraction algorithm with a worst case complexity of O(p n + k) for the search phase, where n is the size of the data set and k is the number of cells inter...
متن کاملPer-Fragment Image-based Flow Visualization using Interactive Surface Extraction from Unstructured Grids
We present a method for image-based visualization of flow fields on unstructured grids. For interactive exploration of flow data from CFD simulations, we combine GPU-accelerated surface extraction methods and line integral convolution (LIC) in a multi-pass algorithm. In contrast to other highly efficient methods, computation of stream lines is performed directly on the unstructured grid, where ...
متن کاملParallel Sn Sweeps on Unstructured Grids: Algorithms for Prioritization, Grid Partitioning, and Cycle Detection
The method of discrete ordinates is commonly used to solve the Boltzmann transport equation. The solution in each ordinate direction is most efficiently computed by sweeping the radiation flux across the computational grid. For unstructured grids this poses many challenges, particularly when implemented on distributed-memory parallel machines where the grid geometry is spread across processors....
متن کاملA Near Optimal Isosurface Extraction Algorithm Using the Span Space - Visualization and Computer Graphics, IEEE Transactions on
We present the “Near Optimal IsoSurface Extraction” (NOISE) algorithm for rapidly extracting isosurfaces from structured and unstructured grids. Using the span space, a new representation of the underlying domain, we develop an isosurface extraction algorithm with a worst case complexity of o(& + c) for the search phase, where n is the size of the data set and k is the number of cells intersect...
متن کاملSimple finite element-based computation of distance functions in unstructured grids
A distance field is a representation of the closest distance from a point to a given surface. Distance fields are widely used in applications ranging from computer vision, physics and computer graphics and have been the subject of research of many authors in the last decade. Most of the methods for computing distance fields are devoted to Cartesian grids while little attention has been paid to ...
متن کامل